Data abstractions for decision tree induction
نویسندگان
چکیده
منابع مشابه
Decision Tree Induction: Data Classification using Height-Balanced Tree
Classification is considered as one of the building blocks in data mining problem and the major issues concerning data mining in large databases are efficiency and scalability. In this paper we propose a data classification method using AVL trees enhances the quality and stability of data mining problems. Researchers from various disciplines such as statistics, machine learning, pattern recogni...
متن کاملAbstractions in Decision Procedures for Algebraic Data Types Abstractions in Decision Procedures for Algebraic Data Types Abstractions in Decision Procedures for Algebraic Data Types
ions in Decision Procedures for Algebraic Data Types
متن کاملUsing Decision Tree Induction for Discovering Holes in Data
Existing research in machine learning and data mining has been focused on finding rules or regularities among the data cases. Recently, it was shown that those associations that are missing in data may also be interesting. These missing associations are the holes or empty regions. The existing algorithm for discovering holes has a number of shortcomings. It requires each hole to contain no data...
متن کاملLinguistic Decision Tree Induction
Label Semantics is a random set based framework for modeling imprecise concepts where the degree of appropriateness of a linguistic expression as a description of a certain value is measured in terms of how the set of appropriate labels for that value varies across a population. An approach to decision tree induction based on this framework was studied. A new decision tree learning algorithm wa...
متن کاملDecision Tree Induction
Decision Tree Induction (DTI) is an important step of the segmentation methodology. It can be viewed as a tool for the analysis of large datasets characterized by high dimensionality and nonstandard structure. Segmentation follows a nonparametric approach, since no hypotheses are made on the variable distribution. The resulting model has the structure of a tree graph. It is considered a supervi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00178-0